The polynomial endomorphisms of graph algebras
نویسندگان
چکیده
منابع مشابه
Polynomial endomorphisms of the Cuntz algebras arising from permutations. II —Branching laws of endomorphisms—
For a subgroup H of a group G, an irreducible decomposition of π|H for an irreducible representation π of G is one of main study in representation theory([12]). When such decomposition holds, the decomposition formula is called a branching law. This is reformulated as the branching which is brought by the inclusion map ι from H to G, that is, ι∗(π) ≡ π ◦ ι gives a map from RepG to RepH. In gene...
متن کاملEndomorphisms and Modular Theory of 2-graph C*-algebras
In this paper, we initiate the study of endomorphisms and modular theory of the graph C*-algebras Oθ of a 2-graph F + θ on a single vertex. We prove that there is a semigroup isomorphism between unital endomorphisms of Oθ and its unitary pairs with a twisted property. We characterize when endomorphisms preserve the fixed point algebra F of the gauge automorphisms and its canonical masa D. Some ...
متن کاملIncidence Algebras as Algebras of Endomorphisms
Vx = {yeP:xSy} is the principal filter generated by x. The filters on P are easily seen to be the open sets for a topology on P, and the increasing maps from P to another locally finite partially ordered set Q are precisely the continuous functions from P to Q [5]. For each filter V on P, let M(P9 V\ or simply M(V) when reference to P is understood, denote the free abelian group on V. For filte...
متن کاملBranching laws for polynomial endomorphisms in CAR algebra for fermions, uniformly hyperfinite algebras and Cuntz algebras
Previously, we have shown that the CAR algebra for fermions is embedded in the Cuntz algebra O2 in such a way that the generators are expressed in terms of polynomials in the canonical generators of the latter, and it coincides with the U(1)-fixed point subalgebra A ≡ O 2 of O2 for the canonical gauge action. Based on this embedding formula, some properties of A are studied in detail by restric...
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2020
ISSN: 1661-7207
DOI: 10.4171/ggd/574